Speed-up credit exposure calculations for pricing and risk management

We introduce a new method to calculate the credit exposure of European and path-dependent options. The proposed method is able to calculate accurate expected exposure and potential future exposure profiles under the risk-neutral and the real-world measure. Key advantage of is that it delivers an accuracy comparable to a full re-evaluation and at the same time it is faster than a regression-based method. Core of the approach is solving a dynamic programming problem by function approximation. This yields a closed form approximation along the paths together with the option's delta and gamma. The simple structure allows for highly efficient evaluation of the exposures, even for a large number of simulated paths. The approach is flexible in the model choice, payoff profiles and asset classes. We validate the accuracy of the method numerically for three different equity products and a Bermudan interest rate swaption. Benchmarking against the popular least-squares Monte Carlo approach shows that our method is able to deliver a higher accuracy in a faster runtime.Comment: arXiv admin note: substantial text overlap with arXiv:1905.0023

Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing

Treating high dimensionality is one of the main challenges in the development of computational methods for solving problems arising in finance, where tasks such as pricing, calibration, and risk assessment need to be performed accurately and in real-time. Among the growing literature addressing this problem, Gass et al. [Finance Stoch., 22 (2018), pp. 701--731] propose a complexity reduction technique for parametric option pricing based on Chebyshev interpolation. As the number of parameters increases, however, this method is affected by the curse of dimensionality. In this article, we extend this approach to treat high-dimensional problems: Additionally, exploiting low-rank structures allows us to consider parameter spaces of high dimensions. The core of our method is to express the tensorized interpolation in the tensor train format and to develop an efficient way, based on tensor completion, to approximate the interpolation coefficients. We apply the new method to two model problems: American option pricing in the Heston model and European basket option pricing in the multidimensional Black--Scholes model. In these examples, we treat parameter spaces of dimensions up to 25. The numerical results confirm the low-rank structure of these problems and the effectiveness of our method compared to advanced techniques

Absolute Continuity of Semimartingales

We derive equivalent conditions for the (local) absolute continuity of two laws of semimartingales on random sets. Our result generalizes previous results for classical semimartingales by replacing a strong uniqueness assumption by a weaker uniqueness assumption. The main tool is a generalized Girsanov's theorem, which relates laws of two possibly explosive semimartingales to a candidate density process. Its proof is based on an extension theorem for consistent families of probability measures. Moreover, we show that in a one-dimensional It\^o-diffusion setting our result reproduces the known deterministic characterizations for (local) absolute continuity. Finally, we give a Khasminskii-type test for the absolute continuity of multi-dimensional It\^o-diffusions and derive linear growth conditions for the martingale property of stochastic exponentials

Calibration to American options: numerical investigation of the de-Americanization method.

American options are the reference instruments for the model calibration of a large and important class of single stocks. For this task, a fast and accurate pricing algorithm is indispensable. The literature mainly discusses pricing methods for American options that are based on Monte Carlo, tree and partial differential equation methods. We present an alternative approach that has become popular under the name de-Americanization in the financial industry. The method is easy to implement and enjoys fast run-times (compared to a direct calibration to American options). Since it is based on ad hoc simplifications, however, theoretical results guaranteeing reliability are not available. To quantify the resulting methodological risk, we empirically test the performance of the de-Americanization method for calibration. We classify the scenarios in which de-Americanization performs very well. However, we also identify the cases where de-Americanization oversimplifies and can result in large errors

Analysis of Fourier transform valuation formulas and applications

The aim of this article is to provide a systematic analysis of the conditions such that Fourier transform valuation formulas are valid in a general framework; i.e. when the option has an arbitrary payoff function and depends on the path of the asset price process. An interplay between the conditions on the payoff function and the process arises naturally. We also extend these results to the multi-dimensional case, and discuss the calculation of Greeks by Fourier transform methods. As an application, we price options on the minimum of two assets in L\'evy and stochastic volatility models.Comment: 26 pages, 3 figures, to appear in Appl. Math. Financ

Stability and convergence of Galerkin schemes for parabolic equations with application to Kolmogorov pricing equations in time-inhomogeneous Lévy models

Two essential quantities for the analysis of approximation schemes of evolution equa- tions are stability and convergence. We derive stability and convergence of fully discrete approximation schemes of solutions to linear parabolic evolution equations governed by time dependent coercive operators. We consider abstract Galerkin ap- proximations in space combined with theta-schemes in time. The level of generality of our analysis comprises both a large class of time-dependent operators and a large choice of approximating Galerkin spaces. In particular the results apply to partial integro differential equations for option pricing in time-inhomogeneous Lévy models and allows for a large variety of option types and models. The derivation builds on the strong foundation laid out by von Petersdorff and Schwab (2003) who provide the respective results for the time-homogeneous case. We discuss the assumptions in the context of option pricing

Duality in risk aggregation

A fundamental problem in risk management is the robust aggregation of different sources of risk in a situation where little or no data are available to infer information about their dependencies. A popular approach to solving this problem is to formulate an optimization problem under which one maximizes a risk measure over all multivariate distributions that are consistent with the available data. In several special cases of such models, there exist dual problems that are easier to solve or approximate, yielding robust bounds on the aggregated risk. In this chapter, we formulate a general optimization problem, which can be seen as a doubly infinite linear programming problem, and we show that the associated dual generalizes several well-known special cases and extends to new risk management models we propose